Integer factorization algorithms - PDFSEARCH.IO - Document Search Engine

Integer factorization algorithms
Results: 208

#	Item
131	1 abelian group 266 absolute value 307 addition mod P 427 additive identity 293, 497 additive inverse 293 Add to Reading List Source URL: www.math.umn.edu Language: English - Date: 2005-08-31 12:46:44 Integer sequences Integer factorization algorithms Finite fields Modular arithmetic Computational hardness assumptions Prime number Quadratic residue RSA Quadratic sieve Mathematics Cryptography Abstract algebra
132	(March 26, [removed]Cryptographic Primitives Paul Garrett [removed] http://www.math.umn.edu/˜garrett/ Add to Reading List Source URL: www.math.umn.edu Language: English - Date: 2007-03-26 14:27:46 Public-key cryptography Integer sequences Integer factorization algorithms RSA Primality tests Quadratic sieve Prime number Integer factorization Factorization Cryptography Mathematics Electronic commerce
133 $Integer factorization algorithms / Finite fields / Euclidean algorithm / Continued fraction / Elliptic curve / Quadratic sieve / Lenstra elliptic curve factorization / XTR / Prime number / Mathematics / Abstract algebra / Number theory$	Cryptanalysis of RSA Using the Ratio of the Primes Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France [removed] Add to Reading List Source URL: www.math.unicaen.fr Language: English - Date: 2009-03-27 17:29:38 Integer factorization algorithms Finite fields Euclidean algorithm Continued fraction Elliptic curve Quadratic sieve Lenstra elliptic curve factorization XTR Prime number Mathematics Abstract algebra Number theory
134	Modular Methods in CoCoA What are modular methods? When you have to do a quick calculation on the back of an envelope, you might calculate the sum or product of two (small) polynomials, and you would most likely use a di Add to Reading List Source URL: cocoa.dima.unige.it Language: English - Date: 2005-05-26 03:13:51 Polynomials Computer algebra Finite fields Euclidean algorithm Factorization of polynomials Integer factorization algorithms Greatest common divisor Prime number Algebraic number field Mathematics Abstract algebra Algebra
135	Pollard’s p 1 Factoring Algorithm As a quick review, Pollard’s p 1 factoring algorithm is eﬃcient only in the case where one of the primes, say p, has the property that p 1 is a product of small primes (such a p 1 Add to Reading List Source URL: www.untruth.org Language: English - Date: 2014-03-18 20:25:11 Prime number Factorization Finite fields Integer factorization algorithms Mathematics Algebra
136	Integer Factorization Per Leslie Jensen Master Thesis D I K U Add to Reading List Source URL: pgnfs.org Language: English - Date: 2011-06-27 08:55:21 Abstract algebra Integer factorization Quadratic sieve General number field sieve RSA Prime number Primality test Factorization Discrete logarithm Mathematics Cryptography Integer factorization algorithms
137	THREE NEW FACTORS OF FERMAT NUMBERS R. P. BRENT, R. E. CRANDALL, K. DILCHER, AND C. VAN HALEWYN Abstract We report the discovery of a new factor for each of the Fermat numbers F13 , F15 , F16 . These new factors have 27, Add to Reading List Source URL: gan.anu.edu.au Language: English - Date: 2003-11-05 11:07:22 Integer sequences Integer factorization algorithms Euclidean plane geometry Fermat number Number theory Pierre de Fermat Lenstra elliptic curve factorization Integer factorization Richard P. Brent Mathematics Abstract algebra Group theory
138	pomerance.qxp[removed]:16 AM Page[removed]A Tale of Two Sieves Carl Pomerance (This paper is dedicated to the memory of my friend and Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2005-03-02 15:21:07 Numbers Quadratic sieve General number field sieve Lenstra elliptic curve factorization Prime number Integer factorization Factorization Sieve of Eratosthenes Factor base Integer factorization algorithms Mathematics Number theory
139	version[removed]Primality testing with Gaussian periods Primality testing with Gaussian periods H. W. Lenstra jr. and Carl Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-10-01 13:32:09 Primality tests Finite fields Polynomials Integer factorization algorithms Field theory Prime number Root of unity Number theory Miller–Rabin primality test Abstract algebra Mathematics Algebra
140	The Power of Quantum Computation Ashley Montanaro Department of Computer Science, University of Bristol 8 May 2014 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-05-08 10:04:21 Integer factorization algorithms Computational complexity theory Quantum information science Integer factorization Quantum algorithm Quantum computer Prime number General number field sieve RSA Theoretical computer science Applied mathematics Cryptography

UPDATE